home *** CD-ROM | disk | FTP | other *** search
- Path: news.flashnet.it!usenet
- From: in target <intarget@flashnet.it>
- Newsgroups: comp.misc,comp.unix.programmer,comp.lang.c,comp.programming
- Subject: Full Text Search Algorithms
- Date: Tue, 16 Apr 1996 18:03:42 -0700
- Organization: In Target
- Message-ID: <3174436E.1A36@flashnet.it>
- NNTP-Posting-Host: ppp-029.flashnet.it
- Mime-Version: 1.0
- Content-Type: text/plain; charset=us-ascii
- Content-Transfer-Encoding: 7bit
- X-Mailer: Mozilla 2.01 (Win16; I)
-
- I need to build a full text search engine which can handle a large amount
- of documents (about 300,000 plain text documents 3Kbytes long).
- I tried with by implementing inverted lists of words with BTrees indexes,
- but the resulting software becomes too slow after the first 20,000
- documents. In addition, there's too much wasted space in the indexes.
-
- Can anybody suggest me a better algorithm and, if possible, tell me where
- can I find a technical description of it (possibly on the NET)?
-
- Thanks for all
-